Belief Propagation for Error Correting Codes and Lossy Compression Using Multilayer Perceptrons
نویسندگان
چکیده
The belief propagation (BP) based algorithm is investigated as a potential decoder for both of error correcting codes and lossy compression, which are based on non-monotonic tree-like multilayer perceptron encoders. We discuss that whether the BP can give practical algorithms or not in these schemes. The BP implementations in those kind of fully connected networks unfortunately shows strong limitation, while the theoretical results seems a bit promising. Instead, it reveals it might have a rich and complex structure of the solution space via the BP-based algorithms.
منابع مشابه
Belief Propagation for Error Correcting Codes and Lossy Compression Using Multilayer Perceptrons
The belief propagation (BP) based algorithm is investigated as a potential decoder for both of error correcting codes and lossy compression, which are based on non-monotonic tree-like multilayer perceptron encoders. We discuss that whether the BP can give practical algorithms or not in these schemes. The BP implementations in those kind of fully connected networks unfortunately shows strong lim...
متن کاملStatistical mechanics of lossy compression using multilayer perceptrons.
Statistical mechanics is applied to lossy compression using multilayer perceptrons for unbiased Boolean messages. We utilize a treelike committee machine (committee tree) and treelike parity machine (parity tree) whose transfer functions are monotonic. For compression using a committee tree, a lower bound of achievable distortion becomes small as the number of hidden units K increases. However,...
متن کاملLinear Complexity Lossy Compressor for Binary Redundant Memoryless Sources
A lossy compression algorithm for binary redundant memoryless sources is presented. The proposed scheme is based on sparse graph codes. By introducing a nonlinear function, redundant memoryless sequences can be compressed. We propose a linear complexity compressor based on the extended belief propagation, into which an inertia term is heuristically introduced, and show that it has near-optimal ...
متن کاملNon-Linear Codes on Sparse Graphs
Spatial coupling has been successfully applied to various problems, ranging from error correcting codes to compressive sensing, and shown to have outstanding performance under message-passing algorithms. In particular, spatially coupled low-density parity-check (LDPC) codes were proven to universally achieve capacity under belief-propagation (BP) decoding. In this research proposal, we describe...
متن کاملIterative Algorithms For Lossy Source Coding
This thesis explores the problems of lossy source coding and information embedding. For lossy source coding, we analyze low density parity check (LDPC) codes and low density generator matrix (LDGM) codes for quantization under a Hamming distortion. We prove that LDPC codes can achieve the rate-distortion function. We also show that the variable node degree of any LDGM code must become unbounded...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011